151 research outputs found
Fourier Domain Decoding Algorithm of Non-Binary LDPC codes for Parallel Implementation
For decoding non-binary low-density parity check (LDPC) codes,
logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing
quantization effects of SP algorithm in conjunction with FFT. Since FFT is not
applicable in the logarithm domain, the computations required at check nodes in
the Log-SP algorithms are computationally intensive. What is worth, check nodes
usually have higher degree than variable nodes. As a result, most of the time
for decoding is used for check node computations, which leads to a bottleneck
effect. In this paper, we propose a Log-SP algorithm in the Fourier domain.
With this algorithm, the role of variable nodes and check nodes are switched.
The intensive computations are spread over lower-degree variable nodes, which
can be efficiently calculated in parallel. Furthermore, we develop a fast
calculation method for the estimated bits and syndromes in the Fourier domain.Comment: To appear in IEICE Trans. Fundamentals, vol.E93-A, no.11 November
201
Spatially-Coupled MacKay-Neal Codes and Hsu-Anastasopoulos Codes
Kudekar et al. recently proved that for transmission over the binary erasure
channel (BEC), spatial coupling of LDPC codes increases the BP threshold of the
coupled ensemble to the MAP threshold of the underlying LDPC codes. One major
drawback of the capacity-achieving spatially-coupled LDPC codes is that one
needs to increase the column and row weight of parity-check matrices of the
underlying LDPC codes.
It is proved, that Hsu-Anastasopoulos (HA) codes and MacKay-Neal (MN) codes
achieve the capacity of memoryless binary-input symmetric-output channels under
MAP decoding with bounded column and row weight of the parity-check matrices.
The HA codes and the MN codes are dual codes each other.
The aim of this paper is to present an empirical evidence that
spatially-coupled MN (resp. HA) codes with bounded column and row weight
achieve the capacity of the BEC. To this end, we introduce a spatial coupling
scheme of MN (resp. HA) codes. By density evolution analysis, we will show that
the resulting spatially-coupled MN (resp. HA) codes have the BP threshold close
to the Shannon limit.Comment: Corrected typos in degree distributions \nu and \mu of MN and HA
code
Spatially-Coupled MacKay-Neal Codes with No Bit Nodes of Degree Two Achieve the Capacity of BEC
Obata et al. proved that spatially-coupled (SC) MacKay-Neal (MN) codes
achieve the capacity of BEC. However, the SC-MN codes codes have many variable
nodes of degree two and have higher error floors. In this paper, we prove that
SC-MN codes with no variable nodes of degree two achieve the capacity of BEC
Spatially-Coupled Precoded Rateless Codes
Raptor codes are rateless codes that achieve the capacity on the binary
erasure channels. However the maximum degree of optimal output degree
distribution is unbounded. This leads to a computational complexity problem
both at encoders and decoders. Aref and Urbanke investigated the potential
advantage of universal achieving-capacity property of proposed
spatially-coupled (SC) low-density generator matrix (LDGM) codes. However the
decoding error probability of SC-LDGM codes is bounded away from 0. In this
paper, we investigate SC-LDGM codes concatenated with SC low-density
parity-check codes. The proposed codes can be regarded as SC Hsu-Anastasopoulos
rateless codes. We derive a lower bound of the asymptotic overhead from
stability analysis for successful decoding by density evolution. The numerical
calculation reveals that the lower bound is tight. We observe that with a
sufficiently large number of information bits, the asymptotic overhead and the
decoding error rate approach 0 with bounded maximum degree
Efficient Termination of Spatially-Coupled Codes
Spatially-coupled low-density parity-check codes attract much attention due
to their capacity-achieving performance and a memory-efficient sliding-window
decoding algorithm. On the other hand, the encoder needs to solve large linear
equations to terminate the encoding process. In this paper, we propose modified
spatially-coupled codes. The modified (\dl,\dr,L) codes have less rate-loss,
i.e., higher coding rate, and have the same threshold as (\dl,\dr,L) codes
and are efficiently terminable by using an accumulator
Design and Performance of Rate-compatible Non-Binary LDPC Convolutional Codes
In this paper, we present a construction method of non-binary low-density
parity-check (LDPC) convolutional codes. Our construction method is an
extension of Felstroem and Zigangirov construction for non-binary LDPC
convolutional codes. The rate-compatibility of the non-binary convolutional
code is also discussed. The proposed rate-compatible code is designed from one
single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2.
Higher-rate codes are produced by puncturing the mother code and lower-rate
codes are produced by multiplicatively repeating the mother code. Simulation
results show that non-binary LDPC convolutional codes of rate 1/2 outperform
state-of-the-art binary LDPC convolutional codes with comparable constraint bit
length. Also the derived low-rate and high-rate non-binary LDPC convolutional
codes exhibit good decoding performance without loss of large gap to the
Shannon limits.Comment: 8 pages, submitted to IEICE transactio
Multi-Dimensional Spatially-Coupled Codes
Spatially-coupled (SC) codes are constructed by coupling many regular
low-density parity-check codes in a chain. The decoding chain of SC codes stops
when facing burst erasures. This problem can not be overcome by increasing
coupling number. In this paper, we introduce multi-dimensional (MD) SC codes.
Numerical results show that 2D-SC codes are more robust to the burst erasures
than 1D-SC codes. Furthermore, we consider designing MD-SC codes with smaller
rateloss
Spatially-Coupled Precoded Rateless Codes with Bounded Degree Achieve the Capacity of BEC under BP decoding
Raptor codes are known as precoded rateless codes that achieve the capacity
of BEC. However the maximum degree of Raptor codes needs to be unbounded to
achieve the capacity. In this paper, we prove that spatially-coupled precoded
rateless codes achieve the capacity with bounded degree under BP decoding
- …